Computable Categoricity of Graphs with Finite Components
نویسندگان
چکیده
A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably categorical graphs. We restrict ourselves to strongly locally finite graphs; these are the graphs all of whose components are finite. We present a necessary and sufficient condition for certain classes of strongly locally finite graphs to be computably categorical. We prove that if there exists an infinite ∆2-set of components that can be properly embedded into infinitely many components of the graph then the graph is not computably categorical. We also show that the ∆2-bound found is sharp. This is proved by a construction (that we outline in this paper) that builds a strongly locally finite computably categorical graph with an infinite chain of properly embedded components. There are also several examples.
منابع مشابه
Categoricity Properties for Computable Algebraic Fields
We examine categoricity issues for computable algebraic fields. Such fields behave nicely for computable dimension: we show that they cannot have finite computable dimension greater than 1. However, they behave less nicely with regard to relative computable categoricity: we give a structural criterion for relative computable categoricity of these fields, and use it to construct a field that is ...
متن کاملFinite Computable Dimension and Degrees of Categoricity
We first give an example of a rigid structure of computable dimension 2 such that the unique isomorphism between two non-computably isomorphic computable copies has Turing degree strictly below 0′′, and not above 0′. This gives a first example of a computable structure with a degree of categoricity that does not belong to an interval of the form [0(α),0(α+ 1)] for any computable ordinal α. We t...
متن کاملComputable Categoricity versus Relative Computable Categoricity
We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. We show that every 1-decidable computably categorical structure is relatively ∆2-categorical. We study the complexity of various index sets associated with computable categoricity and relative computable categoricity. We also...
متن کاملOn Computable Categoricity
We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. In particular, we show that every 1-decidable computably categorical structure is relatively ∆2-categorical, but that there is a computably categorical structure that is not even relatively arithmetically categorical. We also...
متن کاملEffective categoricity of equivalence structures
We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence classes, or A has only finitely many infinite classes, bounded character, and at most one finite k such that there are infinitely many classes of size k. We also prove that all computably categorical structures are rela...
متن کامل